The parallel rational Arnoldi algorithm
نویسندگان
چکیده
Since version 2.4 of the RKToolbox, the rat krylov function can simulate the parallel construction of a rational Krylov basis. This is done by imposing various nonzero patterns in a so-called continuation matrix T . Simply speaking, the j-th column of this matrix contains the coefficients of the linear combination of j rational Krylov basis vectors which have been used to compute the next (j + 1)-th basis vector. Therefore T is an upper triangular matrix.
منابع مشابه
Rational Krylov Algorithms for Eigenvalue Computation and Model Reduction
Rational Krylov is an extension of the Lanczos or Arnoldi eigenvalue algorithm where several shifts (matrix factorizations) are performed in one run. A variant has been developed, where these factoriza-tions are performed in parallel. It is shown how Rational Krylov can be used to nd a reduced order model of a large linear dynamical system. In Electrical Engineering, it is important that the re...
متن کاملAdaptive Rational Interpolation: Arnoldi and Lanczos-like Equations
The Arnoldi and Lanczos algorithms, which belong to the class of Krylov subspace methods, are increasingly used for model reduction of large scale systems. The standard versions of the algorithms tend to create reduced order models that poorly approximate low frequency dynamics. Rational Arnoldi and Lanczos algorithms produce reduced models that approximate dynamics at various frequencies. This...
متن کاملRational Krylov approximation of matrix functions: Numerical methods and optimal pole selection∗
Matrix functions are a central topic of linear algebra, and problems of their numerical approximation appear increasingly often in scientific computing. We review various rational Krylov methods for the computation of large-scale matrix functions. Emphasis is put on the rational Arnoldi method and variants thereof, namely, the extended Krylov subspace method and the shift-and-invert Arnoldi met...
متن کاملRational Krylov for Large Nonlinear Eigenproblems
Rational Krylov is an extension of the Lanczos or Arnoldi eigenvalue algorithm where several shifts (matrix factorizations) are used in one run. It corresponds to multipoint moment matching in model reduction. A variant applicable to nonlinear eigenproblems is described.
متن کاملAutomated parameter selection for rational Arnoldi approximation of Markov functions
Rational Arnoldi is a powerful method for approximating functions of large sparse matrices times a vector. The selection of asymptotically optimal parameters for this method is crucial for its fast convergence. We present a heuristic for the automated pole selection when the function to be approximated is of Markov type, such as the matrix square root. The performance of this approach is demons...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017